Improving Unconstrained Iris Recognition Performance via Domain Adaptation Metric Learning Method
نویسندگان
چکیده
منابع مشابه
Improving Unconstrained Iris Recognition Performance via Domain Adaptation Metric Learning Method
To improve unconstrained iris recognition system performance in different environments, a performance improvement method of unconstrained iris recognition based on domain adaptation metric learning is proposed. A kernel matrix is calculated as the solution of domain adaptation metric learning. The known Hamming distance computing by intra-class and inter-class is used as the optimization learni...
متن کاملRobust Iris Recognition in Unconstrained Environments
A biometric system provides automatic identification of an individual based on a unique feature or characteristic possessed by him/her. Iris recognition (IR) is known to be the most reliable and accurate biometric identification system. The iris recognition system (IRS) consists of an automatic segmentation mechanism which is based on the Hough transform (HT). This paper presents a robust IRS i...
متن کاملImproving Iris Recognition Performance Using Quality Measures
Biometric methods, which identify people based on physical or behavioural characteristics, are of interest because people cannot forget or lose their physical characteristics in the way that they can lose passwords or identity cards. Among these biometric methods, iris is currently considered as one of the most reliable biometrics because of its unique texture‘s random variation. Moreover, iris...
متن کاملIris Recognition in Image Domain: Quality-Metric Based Comparators
Traditional iris recognition is based on computing efficiently coded representations of discriminative features of the human iris and employing Hamming Distance (HD) as fast and simple metric for biometric comparison in feature space. However, the International Organization for Standardization (ISO) specifies iris biometric data to be recorded and stored in (raw) image form (ISO/IEC FDIS 19794-...
متن کاملMetric Learning for Graph-Based Domain Adaptation
In many domain adaption formulations, it is assumed to have large amount of unlabeled data from the domain of interest (target domain), some portion of it may be labeled, and large amount of labeled data from other domains, also known as source domain(s). Motivated by the fact that labeled data is hard to obtain in any domain, we design algorithms for the settings in which there exists large am...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security and Its Applications
سال: 2016
ISSN: 1738-9976,1738-9976
DOI: 10.14257/ijsia.2016.10.5.03